A Markovian canonical form of second-order matrix-exponential processes
نویسندگان
چکیده
منابع مشابه
A Markovian canonical form of second-order matrix-exponential processes
Besides the fact that – by definition – matrix-exponential processes (MEPs) are more general than Markovian arrival processes (MAPs), only very little is known about the precise relationship of these processes in matrix notation. For the first time, this paper proves the persistent conjecture that – in two dimensions – the respective sets, MAP(2) and MEP(2), are indeed identical with respect to...
متن کاملMoment characterization of matrix exponential and Markovian arrival processes
This paper provides a general framework for establishing the relation between various moments of matrix exponential and Markovian processes. Based on this framework we present an algorithm to compute any finite dimensional moments of these processes based on a set of required (low order) moments. This algorithm does not require the computation of any representation of the given process. We pres...
متن کاملCanonical Form of Order-2 Non-stationary Markov Arrival Processes
Canonical forms of Markovian distributions and processes provide an efficient way of describing these structures by eliminating the redundancy of general representations. Canonical forms of order 2 stationary Markov arrival processes (MAPs) have already been established for both continuous and discrete time. In this paper we present canonical form of continuous time non-stationary MAPs of order...
متن کاملMatrix Functions of Exponential Order
Both the theoretical and practical investigations of various dynamical systems need to extend the definitions of various functions defined on the real axis to the set of matrices. To this end one uses mainly three methods which are based on 1) the Jordan canonical forms, 2) the polynomial interpolation, and 3) the Cauchy integral formula. All these methods give the same result, say g(A), when t...
متن کاملDetermining the order of minimal realization of descriptor systems without use of the Weierstrass canonical form
A common method to determine the order of minimal realization of a continuous linear time invariant descriptor system is to decompose it into slow and fast subsystems using the Weierstrass canonical form. The Weierstrass decomposition should be avoided because it is generally an ill-conditioned problem that requires many complex calculations especially for high-dimensional systems. The present ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2008
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2007.06.020